翻訳と辞書 Words near each other ・ Overfill ・ Overfinch ・ Overfishing ・ Overfitting ・ Overflight ・ Overflow ・ Overflow (software) ・ Overflow can ・ Overflow downdraw method ・ Overflow flag ・ Overflow Glacier ・ Overflow incontinence ・ Overflow magazine ・ Overflow National Wildlife Refuge ・ Overfrock ・ Overfull graph ・ Overgas ・ Overgate ・ Overgate Centre ・ Overgate Hospice Choir ・ Overgeneral Autobiographical Memory ・ Overglaze ・ Overgod ・ Overgrazing ・ Overgrip ・ Overground ・ Overground (band) ・ Overground (song) ・ Overground Music ・ Overground Network Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Overfull graph ： ウィキペディア英語版 Overfull graph In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and half of its order floored, i.e. $|E|\; >\; \backslash Delta\; (G)\; \backslash lfloor\; |V|/2\; \backslash rfloor$ where $|E|$ is the size of ''G'', $\backslash displaystyle\backslash Delta(G)$ is the maximum degree of ''G'', and $|V|$ is the order of ''G''. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires $\backslash displaystyle\backslash Delta\; (G)\; =\; \backslash Delta\; (S)$. ==Properties== A few properties of overfull graphs: # Overfull graphs are of odd order. # Overfull graphs are class 2. That is, they require at least colors in any edge coloring. # A graph ''G'', with an overfull subgraph ''S'' such that $\backslash displaystyle\backslash Delta\; (G)\; =\; \backslash Delta\; (S)$, is of class 2. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Overfull graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.